Study on the Model of Grey Matrix Game Based on Grey Mixed Srategty

It often results in sublevel grey full rank square matrix to become non-feasible solution square matrix when there are null-strategy variables and redundancy constraints in the grey matrix solving method of grey matrix game. We can not directly find the optimum grey game solutions in the non-feasible solution square matrix. However, we define concepts of nullstrategy variables and redundancy constraint equations and study relationships of them in the non-feasible solution square matrix. Further, we prove existence theorem of the optimum grey game solutions in non-square matrix ( ) A m n ⊗ × with constructive methods. In the end, we design the basic steps of solving grey matrix game problems with methods of grey matrix. Keywords—Grey matrix game,Methods of grey matrix,Nullstrategy variables, Redundancy constraint equations